ABSTRACTMetaphors frequently link negative affect with darkness and associations of this type have been established in several experimental paradigms. Given the ubiquity and strength of these associations, people who prefer dark to light may be more prone to negative emotional experiences and symptoms. A five study investigation couches these ideas in a new theoretical framework and then examines them. Across studies, 1 in 4 people preferred the perceptual concept of dark over the perceptual concept of light. These dark-preferring people scored (...) higher in neuroticism and experienced greater depressive feelings in daily life. Moreover, dark preferences shared a robust relationship with depressive symptoms as well as generalised anxiety symptoms. The results provide novel insights into negative affectivity and extend conceptual metaphor theory in a way that is capable of making individual difference predictions. (shrink)

Working within weak subsystems of second-order arithmetic Z2 we consider two versions of the Baire Category theorem which are not equivalent over the base system RCA0. We show that one version (B.C.T.I) is provable in RCA0 while the second version (B.C.T.II) requires a stronger system. We introduce two new subsystems of Z2, which we call RCA+ 0 and WKL+ 0, and show that RCA+ 0 suffices to prove B.C.T.II. Some model theory of WKL+ 0 and its importance in view of (...) Hilbert's program is discussed, as well as applications of our results to functional analysis. (shrink)

Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify nonuniformly computable functions on Baire space from the viewpoint of learning theory and piecewise computability. For instance, we show that mind-change-bounded learnability is equivalent to finite View the MathML source2-piecewise computability 2 denotes the difference of two View the MathML sourceΠ10 sets), error-bounded learnability is equivalent to finite View (...) the MathML sourceΔ20-piecewise computability, and learnability is equivalent to countable View the MathML sourceΠ10-piecewise computability . Second, we introduce disjunction-like operations such as the coproduct based on BHK-like interpretations, and then, we see that these operations induce Galois connections between the Medvedev degree structure and associated Medvedev/ Muchnik-like degree structures. Finally, we interpret these results in the context of the Weihrauch degrees and Wadge-like games. (shrink)

It is known that infinitely many Medvedev degrees exist inside the Muchnik degree of any nontrivial Π10 subset of Cantor space. We shed light on the fine structures inside these Muchnik degrees related to learnability and piecewise computability. As for nonempty Π10 subsets of Cantor space, we show the existence of a finite-Δ20-piecewise degree containing infinitely many finite-2-piecewise degrees, and a finite-2-piecewise degree containing infinitely many finite-Δ20-piecewise degrees 2 denotes the difference of two Πn0 sets), whereas the greatest degrees in (...) these three “finite-Γ-piecewise” degree structures coincide. Moreover, as for nonempty Π10 subsets of Cantor space, we also show that every nonzero finite-2-piecewise degree includes infinitely many Medvedev degrees, every nonzero countable-Δ20-piecewise degree includes infinitely many finite-piecewise degrees, every nonzero finite-2-countable-Δ20-piecewise degree includes infinitely many countable-Δ20-piecewise degrees, and every nonzero Muchnik degree includes infinitely many finite-2-countable-Δ20-piecewise degrees. Indeed, we show that any nonzero Medvedev degree and nonzero countable-Δ20-piecewise degree of a nonempty Π10 subset of Cantor space have the strong anticupping properties. Finally, we obtain an elementary difference between the Medvedev degree structure and the finite-Γ-piecewise degree structure of all subsets of Baire space by showing that none of the finite-Γ-piecewise structures is Brouwerian, where Γ is any of the Wadge classes mentioned above. (shrink)

We show that every analytic set in the Baire space which is dominating contains the branches of a uniform tree, i.e. a superperfect tree with the property that for every splitnode all the successor splitnodes have the same length. We call this property of analytic sets u-regularity. However, we show that the concept of uniform tree does not suffice to characterize dominating analytic sets in general. We construct a dominating closed set with the property that for no uniform tree whose (...) branches are contained in the closed set, the set of these branches is dominating. We also show that from a Σ1n+1-rapid filter a non-u-regular Π1n-set can be constructed. Finally, we prove that ∑12-Kσ-regularity implies ∑12-u-regularity. (shrink)

Attempts to extend the classical Hausdorff difference hierarchy to the case of partitions of a space to k > 2 subsets lead to non‐equivalent notions. In a hope to identify the “right” extension we consider the extensions appeared in the literature so far: the limit‐, level‐, Boolean and Wadge hierarchies of k ‐partitions. The advantages and disadvantages of the four hierarchies are discussed. The main technical contribution of this paper is a complete characterization of the Wadge degrees of Δ02‐measurable k (...) ‐partitions of the Baire space. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

We show that every dominating analytic set in the Baire space has a dominating closed subset. This improves a theorem of Spinas [15] saying that every dominating analytic set contains the branches of a uniform tree, i.e. a superperfect tree with the property that for every splitnode all the successor splitnodes have the same length. In [15], a subset of the Baire space is called u-regular if either it is not dominating or it contains the branches of a uniform tree, (...) and it was proved that Σ21-Kσ-regularity implies Σ21-u-regularity. Here we show that these properties are in fact equivalent. Since the proof of analytic u-regularity uses a game argument it was clear that determinacy implies u-regularity of all sets. Here we show that an inaccessible cardinal is enough to construct a model for projective u-regularity, namely it holds in Solovay's model. Finally we show that forcing with uniform trees is equivalent to Laver forcing. (shrink)

We deal with the consistency strength of ZFC + variants of MA + suitable sets of reals are measurable (and/or Baire, and/or Ramsey). We improve the theorem of Harrington and Shelah [2] repairing the asymmetry between measure and category, obtaining also the same result for Ramsey. We then prove parallel theorems with weaker versions of Martin's axiom (MA(σ-centered), (MA(σ-linked)), MA(Γ + ℵ 0 ), MA(K)), getting Mahlo, inaccessible and weakly compact cardinals respectively. We prove that if there exists r ∈ (...) R such that ω L[ r] 1 = ω 1 and MA holds, then there exists a ▵ 1 3 -selective filter on ω, and from the consistency of ZFC we build a model for ZFC + MA(I) + every ▵ 1 3 -set of reals is Lebesgue measurable, has the property of Baire and is Ramsey. (shrink)

Let κ be a cardinal, and let H κ be the class of sets of hereditary cardinality less than κ ; let τ (κ) > κ be the height of the smallest transitive admissible set containing every element of {κ}∪H κ . We show that a ZFC-definable notion of long unfoldability, a generalisation of weak compactness, implies in the core model K, that the mouse order restricted to H κ is as long as τ. (It is known that some weak (...) large cardinal property is necessary for the latter to hold.) In other terms we delimit its strength as follows: Theorem Con(ZFC+ω2-Π 1 1-Determinacy) ⇒ ⇒Con(ZFC+V=K+∃ a long unfoldable cardinal ⇒ ⇒Con(ZFC+∀X(X # exists) + ‘‘ $\forall D \subseteq \omega_1 D$ is universally Baire ⇔ ∃r∈R(D∈L(r)))’’, and this is set-generically absolute). We isolate a notion of ω-closed cardinal which is weaker than an ω1-Erd\ os cardinal, and show that this bounds the first long unfoldable: Theorem Let κ be ω -closed. Then there is a long unfoldable ł<κ. (shrink)

This thesis is devoted to the exploration of the complexity of some mathematical problems using the framework of computable analysis and descriptive set theory. We will especially focus on Weihrauch reducibility as a means to compare the uniform computational strength of problems. After a short introduction of the relevant background notions, we investigate the uniform computational content of problems arising from theorems that lie at the higher levels of the reverse mathematics hierarchy.We first analyze the strength of the open and (...) clopen Ramsey theorems. Since there is not a canonical way to phrase these theorems as multi-valued functions, we identify eight different multi-valued functions and study their degree from the point of view of Weihrauch, strong Weihrauch, and arithmetic Weihrauch reducibility.We then discuss some new operators on multi-valued functions and study their algebraic properties and the relations with other previously studied operators on problems. In particular, we study the first-order part and the deterministic part of a problem f, capturing the Weihrauch degree of the strongest multi-valued problem that is reducible to f and that, respectively, has codomain $\mathbb {N}$ or is single-valued.These notions proved to be extremely useful when exploring the Weihrauch degree of the problem $\mathsf {DS}$ of computing descending sequences in ill-founded linear orders. They allow us to show that $\mathsf {DS}$, and the Weihrauch equivalent problem $\mathsf {BS}$ of finding bad sequences through non-well quasi-orders, while being very “hard” to solve, are rather weak in terms of uniform computational strength. We then generalize $\mathsf {DS}$ and $\mathsf {BS}$ by considering $\boldsymbol {\Gamma }$ -presented orders, where $\boldsymbol {\Gamma }$ is a Borel pointclass or $\boldsymbol {\Delta }^1_1$, $\boldsymbol {\Sigma }^1_1$, $\boldsymbol {\Pi }^1_1$. We study the obtained $\mathsf {DS}$ -hierarchy and $\mathsf {BS}$ -hierarchy of problems in comparison with the Baire hierarchy and show that they do not collapse at any finite level.Finally, we work in the context of geometric measure theory and we focus on the characterization, from the point of view of descriptive set theory, of some conditions involving the notions of Hausdorff/Fourier dimension and Salem sets. We first work in the hyperspace $\mathbf {K}$ of compact subsets of $[0,1]$ and show that the closed Salem sets form a $\boldsymbol {\Pi }^0_3$ -complete family. This is done by characterizing the complexity of the family of sets having sufficiently large Hausdorff or Fourier dimension. We also show that the complexity does not change if we increase the dimension of the ambient space and work in $\mathbf {K}$. We also generalize the results by relaxing the compactness of the ambient space and show that the closed Salem sets are still $\boldsymbol {\Pi }^0_3$ -complete when we endow $\mathbf {F}$ with the Fell topology. A similar result holds also for the Vietoris topology.We conclude by analyzing the same notions from the point of view of effective descriptive set theory and Type-2 Theory of Effectivity, and show that the complexities remain the same also in the lightface case. In particular, we show that the family of all the closed Salem sets is $\Pi ^0_3$ -complete. We furthermore characterize the Weihrauch degree of the functions computing Hausdorff and Fourier dimension of closed sets.prepared by Manlio Valenti.E-mail:[email protected]. (shrink)

Argues against D. Hume's (1825) treatise "Of Miracles," which is often used to disprove the existence of psi. Hume states that a miracle is a violation of the laws of nature which are proved to be true by common experience, and that the only sufficient testimony for a miracle would be testimony whose falsehood would be even more miraculous than the miracle itself. The primary objections to Hume's argument are that (1) it is tautological, since it presupposes the nonexistence of (...) miraculous events, and (2) as a metaphysical statement, it is inappropriate when considering empirical evidence, which should be judged by its own rule. (shrink)

Let $\mathcal {I}$ be an ideal on $\omega $. For $f,\,g\in \omega ^{\omega }$ we write $f \leq _{\mathcal {I}} g$ if $f(n) \leq g(n)$ for all $n\in \omega \setminus A$ with some $A\in \mathcal {I}$. Moreover, we denote $\mathcal {D}_{\mathcal {I}}=\{f\in \omega ^{\omega }: f^{-1}[\{n\}]\in \mathcal {I} \text { for every } n\in \omega \}$ (in particular, $\mathcal {D}_{\mathrm {Fin}}$ denotes the family of all finite-to-one functions).We examine cardinal numbers $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal (...) {I}}))$ and $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathrm {Fin}}\times \mathcal {D}_{\mathrm {Fin}}))$ describing the smallest sizes of unbounded from below with respect to the order $\leq _{\mathcal {I}}$ sets in $\mathcal {D}_{\mathrm {Fin}}$ and $\mathcal {D}_{\mathcal {I}}$, respectively. For a maximal ideal $\mathcal {I}$, these cardinals were investigated by M. Canjar in connection with coinitial and cofinal subsets of the ultrapowers.We show that $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathrm {Fin}} \times \mathcal {D}_{\mathrm {Fin}})) =\mathfrak {b}$ for all ideals $\mathcal {I}$ with the Baire property and that $\aleph _1 \leq \mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}})) \leq \mathfrak {b}$ for all coanalytic weak P-ideals (this class contains all $\bf {\Pi ^0_4}$ ideals). What is more, we give examples of Borel (even $\bf {\Sigma ^0_2}$ ) ideals $\mathcal {I}$ with $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}}))=\mathfrak {b}$ as well as with $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}})) =\aleph _1$.We also study cardinals $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {J}} \times \mathcal {D}_{\mathcal {K}}))$ describing the smallest sizes of sets in $\mathcal {D}_{\mathcal {K}}$ not bounded from below with respect to the preorder $\leq _{\mathcal {I}}$ by any member of $\mathcal {D}_{\mathcal {J}}\!$. Our research is partially motivated by the study of ideal-QN-spaces: those cardinals describe the smallest size of a space which is not ideal-QN. (shrink)

Written by leading researchers in educational and social psychology, learning science, and neuroscience, this edited volume is suitable for a wide-academic readership. It gives definitions of key terms related to motivation and learning alongside developed explanations of significant findings in the field. It also presents cohesive descriptions concerning how motivation relates to learning, and produces a novel and insightful combination of issues and findings from studies of motivation and/or learning across the authors' collective range of scientific fields. The authors provide (...) a variety of perspectives on motivational constructs and their measurement, which can be used by multiple and distinct scientific communities, both basic and applied. (shrink)

ObjectiveTo evaluate the relationship between recently trained paediatricians' ethics knowledge and exposure to a formal ethics or professionalism curriculum during residency.MethodsWe conducted a cross-sectional survey of recently trained paediatricians which included a validated 23-item instrument called the Test of Residents' Ethics Knowledge for Pediatrics. The sample included paediatricians who completed medical school in 2006–2008, whose primary specialty was paediatrics or a paediatric subspecialty, and who completed paediatric residency training in 2010–2011. This sample was stratified based on residency programme variables: presence (...) of a formal curriculum in ethics or professionalism, programme size and American Board of Pediatrics certifying exam passage rate. Paediatricians were randomly selected from each stratum for survey participation.ResultsAmong the 370 responding paediatricians (55%), the mean knowledge score was 17.3 (SD 2.2) out of a possible 23. Presence of a formal curriculum in ethics and/or professionalism was not significantly associated with knowledge. Knowledge was lowest on items about parental requests for a child to undergo genetic testing (2 items, 44% and 85% incorrect), preserving patient confidentiality over email (55% incorrect), decision-making regarding life-sustaining technologies (61% incorrect), and decision-making principles such as assent and parental permission (2 items, 47% and 49% incorrect).ConclusionsThis study highlights several areas in which paediatricians' knowledge may be low and that are amenable to targeted educational interventions. These findings should prompt discussion and research among ethicists and educators about how ethics and professionalism curricula can more consistently influence paediatricians' knowledge. (shrink)

It has often been remarked that science is a young man's game. Thomas Kuhn, for example, claims that revolutionary changes in science are almost always initiated by either young scientists or those new to a field. I subject Kuhn's hypothesis to testing. I examine 24 revolutionary scientific figures mentioned in The Structure of Scientific Revolutions to determine if young scientists are more likely to make revolutionary discoveries than older scientists. My analysis suggests that middle-aged scientists are responsible for initiating more (...) scientific revolutions than young scientists, given the proportion of each group in the total population of scientists. I argue that the popular myth about the correlation between youth and scientific discovery fails to take into account the proportion of young scientists in the population of scientists. (shrink)

We examine the sub-field of philosophy of science using a new method developed in information science, Referenced Publication Years Spectroscopy (RPYS). RPYS allows us to identify peak years in citations in a field, which promises to help scholars identify the key contributions to a field, and revolutionary discoveries in a field. We discovered that philosophy of science, a sub-field in the humanities, differs significantly from other fields examined with this method. Books play a more important role in philosophy of science (...) than in the sciences. Further, Einstein’s famous 1905 papers created a citation peak in the philosophy of science literature. But rather than being a contribution to the philosophy of science, their importance lies in the fact that they are revolutionary contributions to physics with important implications for philosophy of science. (shrink)

Some decades ago, Heidi Hartmann lamented that “[t]he ‘marriage’ between marxism and feminism has been like the marriage of husband and wife depicted in English common law: marxism and feminism are one, and that one is marxism.”[1] By this, she meant that attempts at a feminist theory had ultimately collapsed into marxism, and so succeeded only in rendering sex inequality derivative of, hence, secondary to class inequality, and as such to be overcome only by ending class inequality. These attempts were (...) in a sense self-defeating, negating the need from which they had emerged, the need for feminism as such. In 1982, Catharine MacKinnon confronted and attempted to remedy this. She developed a theory of sexuality as to feminism what work is to marxism, and thereby elevated feminism to a theory of the kind that marxism is, parallel rather than subordinate to it. She thus made sex inequality finally the issue. But, paradoxically, at the very same time, MacKinnon paralysed feminism, for she revealed men’s oppression of women as unknowable. If men’s oppression of women is unknowable, then feminism, as the movement to end that oppression, is impossible. Susan Bernick recognised this, saying, “MacKinnon’s legacy to feminism is the impossibility of any future feminism. Her account makes feminism theoretically impossible.”[2] This makes the most urgent task for feminism that of explaining how women can know men’s oppression of them. In this thesis, I attempt such an explanation. (shrink)